Mechanized reasoning in Homological Algebra

نویسنده

  • Jesús Aransay
چکیده

We face the problem of obtaining a certified version of a crucial algorithm in the field of Homological Algebra, known as “Perturbation Lemma”. This lemma is intensively used in the software system “Kenzo”, devoted to symbolic computation in Homological Algebra. To this end, we use the proof assistant “Isabelle”. Our main motivations are to increase the knowledge in the algorithmic nature of this mathematical result, as well as to evaluate different possibilities offered by Isabelle in order to prove theorems in Homological Algebra. The memoir is divided into five chapters. In the first one, an introduction to some tools in Homological Algebra, Symbolic Computation and Theorem Proving is given. More concretely, some definitions of algebraic structures and results needed to state the Perturbation Lemma are given; relevant information for our work about encoding algebraic structures in Kenzo and Isabelle is also presented. In the second chapter the Perturbation Lemma is stated, as well as a formal proof of it, based on a proof by F. Sergeraert. The third chapter contains results about modeling, formal specification and verification of mathematical results in the theorem prover Isabelle. Four different approaches to produce formal proofs of results in Homological Algebra are proposed and also analysed from different points of view, ranging from the formal specification of each of them, to the automation of proofs obtained. One of the approaches, based on the modular system of Isabelle, is chosen and shown to be appropriate due to its expressiveness, degree of automation, readability and extensibility to new problems, by means of illustrative examples. In the fourth chapter a technique for obtaining certified programs using Isabelle is introduced. The relevance of this technique is twofold: firstly, its originality, as far as it avoids restricting proofs to a constructive logic; secondly, the feasibility of applying it to the kind of mathematical statements we deal with. The fifth chapter contains the conclusions and explores some possibilities for further work. Note: the dissertation has been written in English; it also includes a resume in Spanish at the

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards a higher reasoning level in formalized Homological Algebra

We present a possible solution to some problems to mechanize proofs in Homological Algebra: how to deal with partial functions in a logic of total functions and how to get a level of abstraction that allows the prover to work with morphisms in an equational way.

متن کامل

Towards Interoperable Mechanized Reasoning Systems: the Logic Broker Architecture

There is a growing interest in the integration of mechanized reasoning systems such as automated theorem provers, computer algebra systems, and model checkers. State-of-the-art reasoning systems are the result of many man-years of careful development and engineering, and usually they provide a high degree of sophistication in their respective domain. Yet they often perform poorly when applied o...

متن کامل

Specification and Integration of Theorem Provers and Computer Algebra Systems

Computer algebra systems (CASs) and automated theorem provers (ATPs) exhibit complementary abilities. CASs focus on efficiently solving domain-specific problems. ATPs are designed to allow for the formalization and solution of wide classes of problems within some logical framework. Integrating CASs and ATPs allows for the solution of problems of a higher complexity than those confronted by each...

متن کامل

Abstraction Based Information Technology

ion in AI and CS In the early days of CS, algorithms were often seen as an abstract formulation of procedures. Nowadays, this workshop illustrates well that category theory is associated to an abstract formulation of CS. The example of computer algebra teaches us that such methodologies do not amount to a full abstraction paradigm. Giunchiglia and Walsh introduced theories of abstraction for me...

متن کامل

Speciication and Integration of Theorem Provers and Computer Algebra Systems

Computer algebra systems (CASs) and automated theorem provers (ATPs) exhibit complementary abilities. CASs focus on ee-ciently solving domain-speciic problems. ATPs are designed to allow for the formalization and solution of wide classes of problems within some logical framework. Integrating CASs and ATPs allows for the solution of problems of a higher complexity than those confronted by each c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • AI Commun.

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2008